An adaptive wavelet space‐time SUPG method for hyperbolic conservation laws

This article concerns with incorporating wavelet bases into existing streamline upwind Petrov‐Galerkin (SUPG) methods for the numerical solution of nonlinear hyperbolic conservation laws which are known to develop shock solutions. Here, we utilize an SUPG formulation using continuous Galerkin in space and discontinuous Galerkin in time. The main motivation for such a combination is that these methods have good stability properties thanks to adding diffusion in the direction of streamlines. But they are more expensive than explicit semidiscrete methods as they have to use space‐time formulations. Using wavelet bases we maintain the stability properties of SUPG methods while we reduce the cost of these methods significantly through natural adaptivity of wavelet expansions. In addition, wavelet bases have a hierarchical structure. We use this property to numerically investigate the hierarchical addition of an artificial diffusion for further stabilization in spirit of spectral diffusion. Furthermore, we add the hierarchical diffusion only in the vicinity of discontinuities using the feature of wavelet bases in detection of location of discontinuities. Also, we again use the last feature of the wavelet bases to perform a postprocessing using a denosing technique based on a minimization formulation to reduce Gibbs oscillations near discontinuities while keeping other regions intact. Finally, we show the performance of the proposed combination through some numerical examples including Burgers’, transport, and wave equations as well as systems of shallow water equations.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 2062–2089, 2017     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].     

The 1‐2‐3‐Conjecture for Hypergraphs

A weighting of the edges of a hypergraph is called vertex‐coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e. every edge contains at least two vertices with different weighted degrees. In this article, we show that such a weighting is possible from the weight set for all hypergraphs with maximum edge size and not containing edges solely consisting of identical vertices. The number is best possible for this statement.     

Continuity in law with respect to the Hurst index of some additive functionals of sub-fractional Brownian motion

In this article, first, we prove some properties of the sub-fractional Brownian motion introduced by Bojdecki et al. [Statist. Probab. Lett. 69(2004):405–419]. Second, we prove the continuity in law, with respect to small perturbations of the Hurst index, in some anisotropic Besov spaces, of some continuous additive functionals of the sub-fractional Brownian motion. We prove that our result can be obtained easily, by using the decomposition in law of the sub-fractional Brownian motion given by Bardina and Bascompte [Collect. Math. 61(2010):191–204] and Ruiz de Chavez and Tudor [Math. Rep. 11(2009):67–74], without using the result of Wu and Xiao [Stoch. Proc. Appl. 119(2009):1823–1844] by connecting the sub-fractional Brownian motion to its stationary Gaussian process through Lamperti’s transform. This decomposition in law leads to a better understanding and simple proof of our result.     

Error and stability analysis of numerical solution for the time fractional nonlinear Schrödinger equation on scattered data of general‐shaped domains

In present work, a kind of spectral meshless radial point interpolation (SMRPI) technique is applied to the time fractional nonlinear Schrödinger equation in regular and irregular domains. The applied approach is based on erudite combination of meshless methods and spectral collocation techniques. The point interpolation method with the help of radial basis functions is used to construct shape functions which play as basis functions in the frame of SMRPI. It is proved the scheme is unconditionally stable with respect to the time variable in and also convergent by the order of convergence , . In the current work, the thin plate spline are used as the basis functions and to eliminate the nonlinearity, a simple predictor‐corrector (P‐C) scheme is performed. It is shown that the SMRPI solution, as a complex function, is suitable one for the time fractional nonlinear Schrödinger equation. The results of numerical experiments are compared to analytical solutions to confirm the reliable treatment of these stable solutions. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1043–1069, 2017     

Exact and approximation product solutions form of heat equation with nonlocal boundary conditions using Ritz–Galerkin method with Bernoulli polynomials basis

In this article, a new method is introduced for finding the exact solution of the product form of parabolic equation with nonlocal boundary conditions. Approximation solution of the present problem is implemented by the Ritz–Galerkin method in Bernoulli polynomials basis. The properties of Bernoulli polynomials are first presented, then Ritz–Galerkin method in Bernoulli polynomials is used to reduce the given differential equation to the solution of algebraic equations. Illustrative examples are included to demonstrate the validity and applicability of the techniques presented in this article for finding the exact and approximation solutions. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1143–1158, 2017     

Application of holomorphic invariants in reproducing kernel

We use holomorphic invariants to calculate the Bergman kernel for generalized quasi-homogeneous Reinhardt-Hartogs domains. In addition, we present a complete orthonormal basis for the Bergman space on bounded Reinhardt-Hartogs domains.     

Entire functions sharing one small function CM with their shifts and difference operators

In this article, we mainly devote to proving uniqueness results for entire functions sharing one small function CM with their shift and difference operator simultaneously. Let f(z) be a nonconstant entire function of finite order, c be a nonzero finite complex constant,and n be a positive integer. If f(z), f(z + c), and ?_c~n f(z) share 0 CM, then f(z + c) ≡ Af(z),where A(= 0) is a complex constant. Moreover, let a(z), b(z)( ≡ 0) ∈ S(f) be periodic entire functions with period c and if f(z)-a(z), f(z + c)-a(z), ?_c~n f(z)-b(z) share 0 CM, then f(z + c) ≡ f(z).     

The pointwise estimates of solutions for a nonlinear convection diffusion reaction equation

This paper studies the time asymptotic behavior of solutions for a nonlinear convection diffusion reaction equation in one dimension.First,the pointwise estimates of solutions are obtained,furthermore,we obtain the optimal L~p,1≤ p ≤ +∞,convergence rate of solutions for small initial data.Then we establish the local existence of solutions,the blow up criterion and the sufficient condition to ensure the nonnegativity of solutions for large initial data.Our approach is based on the detailed analysis of the Green function of the linearized equation and some energy estimates.     

一类新的(2n-1)点二重动态逼近细分

利用正弦函数构造了一类新的带有形状参数ω的(2n-1)点二重动态逼近细分格式.从理论上分析了随n值变化时这类细分格式的C~k连续性和支集长度;算法的一个特色是随着细分格式中参数ω的取值不同,相应生成的极限曲线的表现张力也有所不同,而且这一类算法所对应的静态算法涵盖了Chaikin,Hormann,Dyn,Daniel和Hassan的算法.文末附出大量数值实例,在给定相同的初始控制顶点,且极限曲线达到同一连续性的前提下和现有几种算法做了比较,数值实例表明这类算法生成的极限曲线更加饱满,表现力更强.